Boolean satisfiability problem

Results: 324



#Item
231Constraint programming / Graphical models / Probability theory / Logic in computer science / Boolean satisfiability problem / Belief propagation / Markov random field / Constraint satisfaction problem / Unit propagation / Theoretical computer science / Applied mathematics / Mathematics

A New Look at Survey Propagation and Its Generalizations ELITZA MANEVA, ELCHANAN MOSSEL, AND MARTIN J. WAINWRIGHT University of California—Berkeley, Berkeley, California Abstract. This article provides a new conceptual

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2007-07-31 14:18:53
232Boolean algebra / Propositional calculus / Logic in computer science / NP-complete problems / Conjunctive normal form / Boolean satisfiability problem / Prolog / Propositional variable / Rewriting / Theoretical computer science / Logic / Mathematical logic

Under consideration for publication in Theory and Practice of Logic Programming 1 Logic Programming with Satisfiability MICHAEL CODISH

Add to Reading List

Source URL: www.cs.bgu.ac.il

Language: English - Date: 2008-06-25 01:40:23
233Cantons of Switzerland / Model checking / Boolean satisfiability problem / ETH Zurich / Røros / Formal methods / True quantified Boolean formula / Zurich / Theoretical computer science / Boolean algebra / Mathematics

Formal Methods Group ETH Zurich ¨ June 2003 Armin Biere, Cyrille Artho, Malek Haroud, Viktor Schuppan Computer Systems Institute ETH Zurich,

Add to Reading List

Source URL: fmics.inria.fr

Language: English - Date: 2003-06-27 09:56:55
234Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Operations research / Boolean satisfiability problem / Solver / Satz / GRASP / Theoretical computer science / Applied mathematics / Mathematics

Seven Challenges in Parallel SAT Solving∗ Youssef Hamadi and Christoph M. Wintersteiger Microsoft Research 7 JJ Thomson Avenue Cambridge CB3 0FB United Kingdom

Add to Reading List

Source URL: www.winterstiger.at

Language: English - Date: 2012-09-29 08:42:50
235Model theory / Predicate logic / Electronic design automation / Logic in computer science / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / True quantified Boolean formula / Skolem normal form / Logic / Theoretical computer science / Mathematical logic

Efficiently Solving Quantified Bit-Vector Formulas Christoph M. Wintersteiger Youssef Hamadi Leonardo de Moura

Add to Reading List

Source URL: www.winterstiger.at

Language: English - Date: 2010-07-29 11:34:28
236Complexity classes / Mathematical optimization / Quantum complexity theory / Structural complexity theory / P versus NP problem / QMA / Boolean satisfiability problem / NP / Cook–Levin theorem / Theoretical computer science / Computational complexity theory / Applied mathematics

Ph/CS 219, 4 March 2009 "Quantum Merlin-Arthur and the local Hamiltonian problem" As we have discussed, we expect that quantum computers can compute the ground state energy of local Hamiltonians in cases where the proble

Add to Reading List

Source URL: www.theory.caltech.edu

Language: English - Date: 2009-03-11 19:28:20
237Applied mathematics / Formal methods / Software / Logic in computer science / Model checking / Electronic design automation / Boolean algebra / Boolean satisfiability problem / Linear temporal logic / Model checkers / Theoretical computer science / NuSMV

NuSMV 2: An OpenSource Tool for Symbolic Model Checking   

Add to Reading List

Source URL: nusmv.fbk.eu

Language: English - Date: 2002-07-09 12:35:04
238Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Numerical software / Boolean satisfiability problem / Solver / Algorithm / Speedup / Theoretical computer science / Applied mathematics / Mathematics

Seven Challenges in Parallel SAT Solving Youssef Hamadi and Christoph M. Wintersteiger Microsoft Research, 21 Station Road, Cambridge CB1 2FB, United Kingdom {youssefh, cwinter}@microsoft.com Abstract

Add to Reading List

Source URL: www.winterstiger.at

Language: English - Date: 2013-07-20 10:54:38
239Mathematical logic / Logic in computer science / NP-complete problems / Boolean algebra / Electronic design automation / Boolean satisfiability problem / Craig interpolation / Conjunctive normal form / Interpolation / Theoretical computer science / Mathematics / Logic

Lazy Decomposition for Distributed Decision Procedures Youssef Hamadi Joao Marques-Silva Christoph M. Wintersteiger

Add to Reading List

Source URL: www.winterstiger.at

Language: English - Date: 2011-11-25 16:24:02
240Complexity classes / Mathematical optimization / NP-complete problems / NP-complete / Boolean satisfiability problem / Approximation algorithm / Algorithm / NP / Heap / Theoretical computer science / Applied mathematics / Computational complexity theory

COMP3170 Analysis of Algorithms and Data Strutures

Add to Reading List

Source URL: www.cs.umanitoba.ca

Language: English - Date: 2007-11-06 12:31:11
UPDATE